Utilization of Idle Time in anM/G/1 Queueing System
نویسندگان
چکیده
منابع مشابه
Discrete Time Analysis of Multi-Server Queueing System with Multiple Working Vacations and Reneging of Customers
This paper analyzes a discrete-time $Geo/Geo/c$ queueing system with multiple working vacations and reneging in which customers arrive according to a geometric process. As soon as the system gets empty, the servers go to a working vacations all together. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. Customer...
متن کاملSurvey on Idle Resources Utilization
As cited in papers on performance measurement and profiling [14], [15], computing power of desktop workstations is available, i.e. unused 50− 70% of the time – not only on weekends and during the night but also during busiest working hours. Since computing capacity steadily increases, these numbers are likely to grow. Usual resource request patterns, however are bursty, i.e. phases of multiple ...
متن کاملEFFECTIVE UTILIZATION OF IDLE TIME IN AN (s,S) INVENTORY WITH POSITIVE SERVICE TIME
We deviate from the Berman et al. models in inventory with positive service time. We establish a necessary and sufficient condition for system stability. Several performance measures are computed. An optimisation problem is discussed. Our analysis suggests that it is optimal to place the replenishment order when the inventory level is positive (even in the zero lead time case). Numerical illust...
متن کاملsynthesis of platinum nanostructures in two phase system
چکیده پلاتین، فلزی نجیب، پایدار و گران قیمت با خاصیت کاتالیزوری زیاد است که کاربرد های صنعتی فراوانی دارد. کمپلکس های پلاتین(ii) به عنوان دارو های ضد سرطان شناخته شدند و در شیمی درمانی بیماران سرطانی کاربرد دارند. خاصیت کاتالیزوری و عملکرد گزینشی پلاتین مستقیماً به اندازه و- شکل ماده ی پلاتینی بستگی دارد. بعضی از نانو ذرات فلزی در سطح مشترک مایع- مایع سنتز شده اند، اما نانو ساختار های پلاتین ب...
A Queueing Loss Model with Heterogeneous Skill Based Servers Under Idle Time Ordering Policies
We consider a queueing loss system with heterogeneous skill based servers with arbitrary service distributions. We assume Poisson arrivals, with each arrival having a vector indicating which of the servers are eligible to serve it. An arrival can only be assigned to a server that is both idle and eligible. Assuming exchangeable eligibility vectors and an idle time ordering assignment policy, th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Management Science
سال: 1975
ISSN: 0025-1909,1526-5501
DOI: 10.1287/mnsc.22.2.202